Two SAOR Iterative Formats for Solving Linear Complementarity Problems

نویسندگان
چکیده

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Improved infeasible-interior-point algorithm for linear complementarity problems

We present a modified version of the infeasible-interior- We present a modified version of the infeasible-interior-point algorithm for monotone linear complementary problems introduced by Mansouri et al. (Nonlinear Anal. Real World Appl. 12(2011) 545--561). Each main step of the algorithm consists of a feasibility step and several centering steps. We use a different feasibility step, which tar...

متن کامل

A New Method for Solving Non-Linear Complementarity Problems

The non-linear complementarity problem NLCP is to find a vector z in IR satisfying 0 6 z ⊥ f(z) > 0, where f is a given function. This problem can be solved by several methods but the most of these methods require a lot of arithmetic operations, and therefore, it is too difficult, time consuming, or expensive to find an approximate solution of the exact solution. In this paper we give a new met...

متن کامل

A New Two-stage Iterative Method for Linear Systems and Its Application in Solving Poisson's Equation

In the current study we investigate the two-stage iterative method for solving linear systems. Our new results shows which splitting generates convergence fast in iterative methods. Finally, we solve the Poisson-Block tridiagonal matrix from Poisson's equation which arises in mechanical engineering and theoretical physics. Numerical computations are presented based on a particular linear system...

متن کامل

Preconditioned Iterative Methods for Solving Linear Least Squares Problems

New preconditioning strategies for solving m × n overdetermined large and sparse linear least squares problems using the CGLS method are described. First, direct preconditioning of the normal equations by the Balanced Incomplete Factorization (BIF) for symmetric and positive definite matrices is studied and a new breakdown-free strategy is proposed. Preconditioning based on the incomplete LU fa...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: International Journal of Information Technology and Computer Science

سال: 2011

ISSN: 2074-9007,2074-9015

DOI: 10.5815/ijitcs.2011.02.06